Faster parameterized algorithm for pumpkin vertex deletion set
نویسندگان
چکیده
منابع مشابه
A faster parameterized algorithm for Pseudoforest Deletion
A pseudoforest is a graph where each connected component contains at most one cycle, or alternatively, a graph that can be turned into a forest by removing at most one edge from each connected component. In this paper, we show that the following problem can be solved in O(3knkO(1)) time: given a graph G and an integer k, can we delete at most k vertices from G such that we obtain a pseudoforest...
متن کاملA faster parameterized algorithm for set packing
We present an efficient parameterized algorithm for the (k, t)-set packing problem, in which we are looking for a collection of k disjoint sets whose union consists of t elements. The complexity of the algorithm is O(2nN log N). For the special case of sets of bounded size, this improves the O((ck)n) algorithm of Jia et al. [2004, J. Algorithms, 50(1)].
متن کاملFaster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments
A tournament is a directed graph T such that every pair of vertices is connected by an arc. A feedback vertex set is a set S of vertices in T such that T −S is acyclic. In this article we consider the Feedback Vertex Set problem in tournaments. Here the input is a tournament T and an integer k, and the task is to determine whether T has a feedback vertex set of size at most k. We give a new alg...
متن کاملFaster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments
A bipartite tournament is a directed graph T := (A ∪ B,E) such that every pair of vertices (a, b), a ∈ A, b ∈ B are connected by an arc, and no arc connects two vertices of A or two vertices of B. A feedback vertex set is a set S of vertices in T such that T − S is acyclic. In this article we consider the Feedback Vertex Set problem in bipartite tournaments. Here the input is a bipartite tourna...
متن کاملA Parameterized Algorithm for Bounded-Degree Vertex Deletion
The d-bounded-degree vertex deletion problem, to delete at most k vertices in a given graph to make the maximum degree of the remaining graph at most d, finds applications in computational biology, social network analysis and some others. It can be regarded as a special case of the (d+2)-hitting set problem and generates the famous vertex cover problem. The d-bounded-degree vertex deletion prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2019
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2019.03.009